Graph Drawing by High-Dimensional Embedding
نویسندگان
چکیده
منابع مشابه
Graph Drawing by High-Dimensional Embedding
We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2-D plane using principal components analysis. Running time is linear in the graph size, and experiments we have carried out show the ability of the method to draw graphs of 10 nodes in few seconds. The new method appea...
متن کاملThree-Dimensional Graph Drawing
A three-dimensional straight-line grid drawing of a graph, henceforth called a 3D drawing, represents the vertices by distinct grid-points in Z and represents each edge by the line segment between its end vertices, such that no two edges cross. In contrast to the case in the plane, it is folklore that every graph has a 3D drawing. For example, the “moment curve” algorithm places the i th vertex...
متن کاملSDE: Graph Drawing Using Spectral Distance Embedding
We present a novel graph drawing algorithm which uses a spectral decomposition of the distance matrix to approximate the graph theoretical distances. The algorithm preserves symmetry and node densities, i.e., the drawings are aesthetically pleasing. The runtime for typical 20, 000 node graphs ranges from 100 to 150 seconds.
متن کاملAn Extended High-Dimensional Method for Interactive Graph Drawing
Graph drawing is an information visualization technology for illustrating relations between objects. Interactive graph drawing is often important since it is difficult to statically lay out complex graphs. For the interactive drawing of general undirected graphs, we previously proposed the high-dimensional approach, which used static graph layouts in high-dimensional spaces to dynamically find ...
متن کاملThree-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. The best previous result generated a drawing bounded by an O( √ n) × O( √ n) × O( √ n) box, with each edge route containing up to 16 bends. Our algorithms initiate the study of bend=bounding box trade-o issues for thre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2004
ISSN: 1526-1719
DOI: 10.7155/jgaa.00089